Interactive Planarization and Optimization of 3D Meshes
نویسندگان
چکیده
Constraining 3D meshes to restricted classes is necessary in architectural and industrial design, but it can be very challenging to manipulate meshes while staying within these classes. Specifically, polyhedral meshes those having planar faces are very important, but also notoriously difficult to generate and manipulate efficiently. We describe an interactive method for computing, optimizing and editing polyhedral meshes. Efficiency is achieved thanks to a numerical procedure combining an alternating least-squares approach with the penalty method. This approach is generalized to manipulate other subsets of polyhedral meshes, as defined by a variety of other constraints.
منابع مشابه
Interactive Inverse 3D Modeling
“Interactive Inverse 3D Modeling” is a user-guided approach to shape construction and redesign that extracts well-structured, parameterized, procedural descriptions from unstructured, hierarchically flat input data, such as point clouds, boundary representation meshes, or even multiple pictorial views of a given inspirational prototype. This approach combines traditional “forward” 3D modeling t...
متن کاملFast Generation of Virtual X-ray Images from Deformable Tetrahedral Meshes (Preprint)
We propose a novel GPU-based approach to render virtual X-ray projections of deformable tetrahedral meshes. These meshes represent the shape and the internal density distribution of a particular anatomical structure and are derived from statistical shape and intensity models (SSIMs). We apply our method to improve the geometric reconstruction of 3D anatomy (e.g. pelvic bone) from 2D X-ray image...
متن کاملDirect (Re)Meshing for Efficient Surface Processing
Many geometry processing techniques exploit the connection between shape and connectivity in triangle meshes to enable advanced processing of the data. These techniques face the challenge that triangle meshes, whether generated by a modeling tool or by 3D scanning, typically contain low quality triangles. The process of constructing good meshes out of sub-optimal ones is termed surface remeshin...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملA Topological Framework for Interactive Queries on 3D Models in the Web
Several technologies exist to create 3D content for the web. With X3D, WebGL, and X3DOM, it is possible to visualize and interact with 3D models in a web browser. Frequently, three-dimensional objects are stored using the X3D file format for the web. However, there is no explicit topological information, which makes it difficult to design fast algorithms for applications that require adjacency ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 32 شماره
صفحات -
تاریخ انتشار 2013